The error pattern correcting code (EPCC) can be constructed to provide asyndrome decoding table targeting the dominant error events of an inter-symbolinterference channel at the output of the Viterbi detector. For the size of thesyndrome table to be manageable and the list of possible error events to bereasonable in size, the codeword length of EPCC needs to be short enough.However, the rate of such a short length code will be too low for hard driveapplications. To accommodate the required large redundancy, it is possible torecord only a highly compressed function of the parity bits of EPCC's tensorproduct with a symbol correcting code. In this paper, we show that the proposedtensor error-pattern correcting code (T-EPCC) is linear time encodable and alsodevise a low-complexity soft iterative decoding algorithm for EPCC's tensorproduct with q-ary LDPC (T-EPCC-qLDPC). Simulation results show thatT-EPCC-qLDPC achieves almost similar performance to single-level qLDPC with a1/2 KB sector at 50% reduction in decoding complexity. Moreover, 1 KBT-EPCC-qLDPC surpasses the performance of 1/2 KB single-level qLDPC at the samedecoder complexity.
展开▼
